Partially dominant choice

Partially Dominant Choice

This paper proposes and analyzes a model of context-dependent choice with stable but incomplete preferences that is based on the idea of partial dominance: An alternative is chosen from a menu if it is not worse than anything in the menu and is also better than something else. This choice procedure provides a simple explanation of the attraction/decoy effect. It reduces to rational choice when ...

Quasi-preference: Choice on Partially Ordered Sets

A preference relation is a total order on a finite set and a quasipreference relation is a partial order. This paper first introduces the classic axiomatic property of preference relation, and develops a similar axiom for the quasi-preference relation.

Brand Choice with Partially Observed Prices

On a universal best choice algorithm for partially ordered sets

For the only known universal best choice algorithm for partially ordered sets with known cardinality and unknown order (proposed by J. Preater) we improve the estimation of the lower bound of its chance of success from the hitherto known constant 1/8 to 1/4. We also show that this result is the best possible for this algorithm, i.e., the 1/4 bound cannot be further improved.

Securely implementable social choice rules with partially honest agents

We define secure implementation with partially honest agents in a social choice model and we show that strategy-proofness is a necessary and sufficient condition for it. This result offers a behavioral foundation for rectangularity ; and it remains valid even with only one partially honest agent. We apply the concept to a single-crossing voting environment, and we prove that it characterizes th...